The Spanning Tree of a Divisible Multiple Graph
نویسندگان
چکیده
منابع مشابه
The Minimum Spanning Tree Problem on a Planar Graph
Finding a spanning tree of minimum weight is one of the best known graph problems. a liner time algorithm for the minimum spanning tree problem on a planar graph. In [1], Cheriton and Tarjan have proposed a linear time algorithm for this problem. The time complexity of our algorithm is the same as that of Cheriton and Tarjan's algorithm. Dierent from Cheriton and Tarjan's algorithm, our algorit...
متن کاملNavigating in a Graph by Aid of Its Spanning Tree
Let G = (V,E) be a graph and T be a spanning tree of G. We consider the following strategy in advancing in G from a vertex x towards a target vertex y: from a current vertex z (initially, z = x), unless z = y, go to a neighbor of z in G that is closest to y in T (breaking ties arbitrarily). In this strategy, each vertex has full knowledge of its neighborhood in G and can use the distances in T ...
متن کاملUsing a Significant Spanning Tree to Draw a Directed Graph
A directed graph can model any ordered relationship between objects. However, visualizing such graphs can be a challenging task. If the graph is undirected, a popular strategy is to choose a significant spanning tree, nominate a vertex as the root, for example the vertex whose distance from all other vertices is minimal, hang the significant spanning subtrees from this root and add in the remai...
متن کاملA Method for Constructing Phylogenetic Tree Based on the Minimum Spanning Tree of the Complete Graph
The evolutionary history of various species can be represented by constructing the phylogenetic tree. In this paper, we proposed a novel method for constructing phylogenetic tree based on the minimal spanning tree of the complete graph, which is taken from the similarity matrix computed by 3D graphical representation of DNA sequences. This method didn’t require sequence alignment and the comput...
متن کاملReliability Evaluation of the Minimum Spanning Tree on Uncertain Graph
Minimum spanning tree is a minimum-cost spanning tree connecting the whole network, but it couldn't be directly obtained on uncertain graph. In this paper, we define the reliability as the existence probability of all minimum spanning trees and present an algorithm for evaluating reliability of the minimum spanning tree on uncertain graph. The time complexity of the algorithm is O(Nmn), where n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatic Control and Computer Sciences
سال: 2018
ISSN: 0146-4116,1558-108X
DOI: 10.3103/s0146411618070325